Straight Skeletons of Monotone Polygons
نویسندگان
چکیده
We study the characteristics of straight skeletons of strictly monotone polygonal chains, and use them to devise an algorithm for computing positively weighted straight skeletons of strictly monotone polygons. Our algorithm runs in O(n log n) time and O(n) space.
منابع مشابه
A Novel Type of Skeleton for Polygons
A new internal structure for simple polygons, the straight skeleton, is introduced and discussed. It is composed of pieces of angular bisectores which partition the interior of a given n-gon P in a tree-like fashion into n monotone polygons. Its straight-line structure and its lower combinatorial complexity may make the straight skeleton preferable to the widely used medial axis of a polygon. A...
متن کاملBisector Graphs for Min-/Max-Volume Roofs over Simple Polygons
Piecewise-linear terrains (“roofs”) over simple polygons were studied by Aichholzer et al. (1995) in their work on straight skeletons of polygons. We show how to construct a roof over a simple polygon that has minimum (or maximum) volume among all roofs that drain water. Such a maximum-volume (minimumvolume) roof can have quadratic (maybe cubic, resp.) number of facets. Our algorithm for comput...
متن کاملImplicit Curved Polygons
This paper presents an approach to the representation of polygons with straight and curved edges by real functions. A “carrier polygon” is an arbitrary simple polygon with straight edges. Application of our method results in a C continuous function F(x,y) with zero value at polygon edges. We combine an efficient algorithm employing a monotone function of a boolean operation, with R-functions. T...
متن کاملApproximating a Motorcycle Graph by a Straight Skeleton
We investigate how a straight skeleton can be used to approximate a motorcycle graph. We explain how to construct a planar straight-line graph G such that the straight skeleton of G reveals the motorcycle graph of M , for every given finite set M of motorcycles. An application of our construction is a proof of the Pcompleteness of the construction problem of straight skeletons of planar straigh...
متن کاملCounting Carambolas
We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of n points in the plane. Configurations of interest include convex polygons, star-shaped polygons and monotone paths. We also consider related problems for directed planar straight-line graphs.
متن کامل